Hybrid high-order semantic graph representation learning for recommendations
نویسندگان
چکیده
Abstract The amount of Internet data is increasing day by with the rapid development information technology. To process massive amounts and solve overload, researchers proposed recommender systems. Traditional recommendation methods are mainly based on collaborative filtering algorithms, which have sparsity problems. At present, most model-based algorithms can only capture first-order semantic cannot high-order information. above issues, in this paper, we propose a hybrid graph neural network model heterogeneous graphs extraction, models users items respectively learning low-dimensional representations for them. We introduced an attention mechanism to allow understand corresponding edge weights adaptively. Simultaneously, also integrates social learn more abundant performed some experiments related datasets. Our method achieved better results than current advanced models, verified model’s effectiveness.
منابع مشابه
Graph Structured Semantic Representation and Learning for Financial News
This study links stock prices of publicly traded companies with online financial news to predict direction of stock price change. Previous work shows this to be an extremely challenging problem. We develop a very high-dimensional representation for news about companies that encodes lexical, syntactic and frame semantic information in graphs. Use of a graph kernel to efficiently compare subgraph...
متن کاملLearning Document Semantic Representation with Hybrid Deep Belief Network
High-level abstraction, for example, semantic representation, is vital for document classification and retrieval. However, how to learn document semantic representation is still a topic open for discussion in information retrieval and natural language processing. In this paper, we propose a new Hybrid Deep Belief Network (HDBN) which uses Deep Boltzmann Machine (DBM) on the lower layers togethe...
متن کاملA Hybrid Graph Representation for Exact Graph Algorithms
Many exact search algorithms for NP-hard graph problems adopt the old Davis-Putman branch-and-reduce paradigm. The performance of these algorithms often suffers from the increasing number of graph modifications, such as vertex/edge deletions, that reduce the problem instance and have to be “taken back” frequently during the search process. We investigate practical implementation-based aspects o...
متن کاملGraph Representation Learning and Graph Classification
Many real-world problems are represented by using graphs. For example, given a graph of a chemical compound, we want do determine whether it causes a gene mutation or not. As another example, given a graph of a social network, we want to predict a potential friendship that does not exist but it is likely to appear soon. Many of these questions can be answered by using machine learning methods i...
متن کاملText-Enhanced Representation Learning for Knowledge Graph
Learning the representations of a knowledge graph has attracted significant research interest in the field of intelligent Web. By regarding each relation as one translation from head entity to tail entity, translation-based methods including TransE, TransH and TransR are simple, effective and achieving the state-of-the-art performance. However, they still suffer the following issues: (i) low pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discover Internet of things
سال: 2021
ISSN: ['2730-7239']
DOI: https://doi.org/10.1007/s43926-021-00017-4